An Efficient Outer Space Algorithm for Generalized Linear Multiplicative Programming Problem
نویسندگان
چکیده
منابع مشابه
An efficient method for generalized linear multiplicative programming problem with multiplicative constraints
We present a practical branch and bound algorithm for globally solving generalized linear multiplicative programming problem with multiplicative constraints. To solve the problem, a relaxation programming problem which is equivalent to a linear programming is proposed by utilizing a new two-phase relaxation technique. In the algorithm, lower and upper bounds are simultaneously obtained by solvi...
متن کاملGeneralized Dual Face Algorithm for Linear Programming
As a natural extension of the dual simplex algorithm, the dual face algorithm performed remarkably in computational experiments with a set of Netlib standard problems. In this paper, we generalize it to bounded-variable LP problems via local duality.
متن کاملAn efficient dynamic programming algorithm for the generalized LCS problem with multiple substring inclusive constraints
In this paper, we consider a generalized longest common subsequence problem with multiple substring inclusive constraints. For the two input sequences X and Y of lengths n and m, and a set of d constraints P = {P1, · · · , Pd} of total length r, the problem is to find a common subsequence Z of X and Y including each of constraint string in P as a substring and the length of Z is maximized. A ne...
متن کاملAn Efficient Dynamic Programming Algorithm for the Generalized LCS Problem with Multiple Substring Exclusion Constrains
In this paper, we consider a generalized longest common subsequence problem with multiple substring exclusion constrains. For the two input sequences X and Y of lengths n and m, and a set of d constrains P = {P1, · · · , Pd} of total length r, the problem is to find a common subsequence Z of X and Y excluding each of constrain string in P as a substring and the length of Z is maximized. The pro...
متن کاملAn Efficient Dynamic Programming Algorithm for a New Generalized LCS Problem
In this paper, we consider a generalized longest common subsequence problem, in which a constraining sequence of length s must be included as a substring and the other constraining sequence of length t must be included as a subsequence of two main sequences and the length of the result must be maximal. For the two input sequences X and Y of lengths n and m, and the given two constraining sequen...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Access
سال: 2020
ISSN: 2169-3536
DOI: 10.1109/access.2020.2990677